Semantics-guided synthesis

This paper develops a new framework for program synthesis, called semantics-guided synthesis (SemGuS), that allows user to provide both the syntax and semantics constructs in language. SemGuS accepts recursively defined big-step semantics, which it, example, be used specify solve problems over an imperative programming language may contain loops with unbounded behavior. The customizable nature of also non-standard such as abstract semantics. In addition framework, we develop algorithm solving is capable synthesizing programs proving unrealizability, by encoding problem proof search Constrained Horn Clauses: particular, our approach first are aware can prove unrealizabilty involve loops, infinite syntactic space. We implemented technique tool MESSY, applied it SyGuS problems(i.e., expressions)